Deterministic Behavioural Models for ConcurrencyVladimiro Sassone
نویسندگان
چکیده
Extended Abstract This paper ooers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models are all proved equivalent in the rather strong sense of being equivalent as categories. The models are: deterministic labelled event structures, generalized trace languages in which the independence relation is context-dependent, and de-terministic languages of pomsets.
منابع مشابه
Deterministic Behavioural Models for Concurrency
Extended Abstract This paper offers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models are all proved equivalent in the rather strong sense of being equivalent as categories. The models are: deterministic labelled event structures, generalized trace languages in which the independence relation ...
متن کاملBayesian Melding of Deterministic Models and Kriging for Analysis of Spatially Dependent Data
The link between geographic information systems and decision making approach own the invention and development of spatial data melding method. These methods combine different data sets, to achieve better results. In this paper, the Bayesian melding method for combining the measurements and outputs of deterministic models and kriging are considered. Then the ozone data in Tehran city are analyze...
متن کاملComparison of Inventory Models for Optimal Working Capital; Case of Aeronautics Company
The goal of supply chain management is to provide products with best quality, low costs and shortest delay of delivery corresponding to customers’ expectations. To ensure that, companies must be in continuous research for management methodologies which allows them the possibility to improve their financial results by decreasing costs and improving their process and thus customers satisfaction. ...
متن کاملFunctorial models for contextual pre-nets
The algebraic models of computation for contextual nets that have been proposed in the literature either rely on non-free monoid of objects, or introduce too many behaviors that must be somewhat filtered out. In this report, we exploit partial membership equational logic to define a suitable theory of models, where the meaningful concurrent computations can be selected by means of membership pr...
متن کاملProbable Innocence and Independent Knowledge
We analyse the Crowds anonymity protocol under the novel assumption that the attacker has independent knowledge on behavioural patterns of individual users. Under such conditions we study, reformulate and extend Reiter and Rubin’s notion of probable innocence, and provide a new formalisation for it based on the concept of protocol vulnerability. Accordingly, we establish new formal relationship...
متن کامل